#include <bits/stdc++.h>
using namespace std;
int biao[10001] = {0};
int main(){
    int n,cnt=1;
    cin>>n;
    while (biao[cnt-1] < n) {
        biao[cnt]=(1+cnt)*cnt/2;
        cnt++;
    }
    cnt--;
    int sum=cnt+1;
    int num1=n-biao[cnt-1];
    if (!(cnt%2==0))
    {
        cout<<sum-num1<<"/"<<num1;
    }
    else
    {
        cout<<num1<<"/"<<sum-num1;
    }
    
    return 0;
}